Codes over $\mathbb{Z}_{p}[u]/{\langle u^r \rangle}\times\mathbb{Z}_{p}[u]/{\langle u^s \rangle}$
نویسندگان
چکیده
منابع مشابه
Cyclic codes over the ring $ \Z_p[u, v]/\langle u^2, v^2, uv-vu\rangle$
Let p be a prime number. In this paper, we study cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes. We obtain all except one ternary optimal code of length 12 as the Gray image of the cyclic codes over the ring Z p [u, v]/u 2 , v 2 , uv − vu. We also characterize the p-ary...
متن کاملCyclic codes over $\mathbb{F}_{2^m}[u]/\langle u^k\rangle$ of oddly even length
Let F2m be a finite field of characteristic 2 and R = F2m [u]/〈u 〉 = F2m + uF2m + . . . + u k−1 F2m (u k = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length 2n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length 2n is provided and a formula to count the n...
متن کاملCyclic codes over $\mathbb{Z}_4[u]/\langle u^k\rangle$ of odd length
Let R = Z4[u]/〈u〉 = Z4 + uZ4 + . . . + uZ4 (u = 0) where k ∈ Z satisfies k ≥ 2. For any odd positive integer n, it is known that cyclic codes over R of length n are identified with ideals of the ring R[x]/〈x − 1〉. In this paper, an explicit representation for each cyclic code over R of length n is provided and a formula to count the number of codewords in each code is given. Then a formula to c...
متن کاملCyclic codes over the ring $\mathbb{F}_p[u,v] / \langle u^k,v^2,uv-vu\rangle$
Let p be a prime number. In this paper, we discuss the structures of cyclic codes over the ring F p [u, v]/u k , v 2 , uv − vu. We find a unique set of generators for these codes. We also study the rank and the Hamming distance of these codes.
متن کاملDNA Cyclic Codes Over The Ring $ \F_2[u, v]/\langle u^2-1, v^3-v, uv-vu \rangle$
In this paper, we mainly study the some structure of cyclic DNA codes of odd length over the ring R = F2[u, v]/〈u 2 − 1, v3 − v, uv − vu〉 which play an important role in DNA computing. We established a direct link between the element of ring R and 64 codons by introducing a Gray map from R to R1 = F2 + uF2, u 2 = 1 where R1 is the ring of four elements. The reverse constrain and the reverse-com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2019
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.514339